Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG
نویسندگان
چکیده
We introduce the theoretical foundations of Tangle 2.0, a probabilistic leaderless consensus protocol based on directed acyclic graph (DAG) called Tangle. The naturally succeeds blockchain as its next evolutionary step it offers features suited to establish more efficient and scalable distributed ledger solutions. Consensus is no longer found in longest chain but heaviest DAG, where PoW replaced by stake- or reputation-based weight function. DAG structure underlying Reality-based UTXO Ledger allow parallel validation transactions without need for total ordering. Moreover, enables removal intermediary miners validators, allowing pure two-step process that follows \emph{propose-vote} paradigm at node level not validator level. propose framework analyse liveness safety under different communication adversary models. This allows providing impossibility results some edge cases asynchronous model. provide formal proof security assuming common random coin.
منابع مشابه
Distributed leaderless consensus algorithms for networked Euler-Lagrange systems
This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange systems. We propose a fundamental consensus algorithm, a consensus algorithm accounting for actuator saturation, and a consensus algorithm accounting for unavailability of measurements of generalised coordinate derivatives, for systems modelled by Euler–Lagrange equati...
متن کاملLeaderless Consensus in Networks of Flexible-Joint Manipulators
∗ Department of Computer Science. CUCEI, University of Guadalajara. Guadalajara, Mexico. ∗∗ Electronics Department. CUCEI, University of Guadalajara. Guadalajara, Mexico. ∗∗∗ Automatic Control Department, SUPELEC. Gif-sur-Yvette, France. ∗∗∗∗ Institute of Industrial and Control Engineering, Technical University of Catalonia. Barcelona, Spain. Emails: {emmanuel.nuno; daniela.valle}@cucei.udg.mx,...
متن کاملAdaptive Leader-Following and Leaderless Consensus of a Class of Nonlinear Systems Using Neural Networks
This paper deals with leader-following and leaderless consensus problems of high-order multi-input/multi-output (MIMO) multi-agent systems with unknown nonlinear dynamics in the presence of uncertain external disturbances. The agents may have different dynamics and communicate together under a directed graph. A distributed adaptive method is designed for both cases. The structures of the contro...
متن کاملOn the DAG Decomposition
3 Yangjun Chen, Yibin Chen 4 5 6 University of Winnipeg 7 8 9 10 11 . 12 ABSTRACT 13 14 In this paper, we propose an efficient algorithm to decompose a directed acyclic graph G into a minimized set of node-disjoint chains, which cover all the nodes of G. For any two nodes u and v on a chain, if u is above v then there is a path from u to v in G. The best algorithm for this problem up to now nee...
متن کاملOn leaderless and leader-following consensus for interacting clusters of second-order multi-agent systems
This paper investigates the group consensus phenomenon for multiple interacting clusters of doubleintegrator agents in the presence of both cooperative and competitive inter-cluster couplings under two different frameworks, viz., the framework that all agents share the same position and velocity interaction topology and the framework that the position and velocity topologies are modeled by tota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3211422